Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
نویسندگان
چکیده
We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoiding walks and trails.
منابع مشابه
Self-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کامل1 1 O ct 2 00 4 Self - avoiding walks and trails on the 3 . 12 2 lattice Anthony
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملSelf-avoiding walks and trails on the 3.122 lattice
We find the generating function of self-avoiding walks (SAWs) and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as SAWs, self-avoiding polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails o...
متن کاملSelf-avoiding trails with nearest-neighbour interactions on the square lattice
Self-avoiding walks and self-avoiding trails, two models of a polymer coil in dilute solution, have been shown to be governed by the same universality class. On the other hand, self-avoiding walks interacting via nearest-neighbour contacts (ISAW) and self-avoiding trails interacting via multiply visited sites (ISAT) are two models of the coil-globule, or collapse transition of a polymer in dilu...
متن کاملCollapse transition of self-avoiding trails on the square lattice
The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails, which map to a particular temperature of interacting self-avoiding trails, showed markedly different behaviour for what was argued to be the collapse transi...
متن کامل